/**
 * Created with IntelliJ IDEA.
 * Description:合并二叉树
 * User: wangxin
 * Date: 2024-11-07
 * Time: 21:36
 */

import java.util.*;


   class TreeNode {
    int val = 0;
    TreeNode left = null;
    TreeNode right = null;
    public TreeNode(int val) {
      this.val = val;
    }
  }

public class test1 {

    public TreeNode mergeTrees (TreeNode t1, TreeNode t2) {
        // write code here

        if(t1 == null){
            return t2;
        }
        if(t2 == null){
            return t1;
        }



        TreeNode head = new TreeNode(t1.val + t2.val);
        head.left = mergeTrees(t1.left,t2.left);
        head.right = mergeTrees(t1.right,t2.right);
        return head;
    }
}
